Forward Analysis for WSTS, Part I: Completions
نویسندگان
چکیده
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now, the theoretical framework for manipulating downward-closed sets was missing. We answer this problem, using insights from domain theory (dcpos and ideal completions), from topology (sobrifications), and shed new light on the notion of adequate domains of limits.
منابع مشابه
Forward Analysis for WSTS, Part III: Karp-Miller Trees
This paper is a sequel of “Forward Analysis for WSTS, Part I: Completions” [STACS 2009, LZI Intl. Proc. in Informatics 3, 433–444] and “Forward Analysis for WSTS, Part II: Complete WSTS” [Logical Methods in Computer Science 8(3), 2012]. In these two papers, we provided a framework to conduct forward reachability analyses of WSTS, using finite representations of downwardsclosed sets. We further ...
متن کاملThe Theory of WSTS: The Case of Complete WSTS
We describe a simple, conceptual forward analysis procedure for ∞-complete WSTS S. This computes the so-called clover of a state. When S is the completion of a WSTS X, the clover in S is a finite description of the downward closure of the reachability set. We show that such completions are ∞-complete exactly when X is an ω-WSTS , a new robust class of WSTS. We show that our procedure terminates...
متن کاملOn a Generalization of a Result by Valk and Jantzen
We show that, under mild assumptions on the effective, well quasiordered set X , one can compute a finite basis of an upward-closed subset U of X if and only if one can decide whether U ∩ ↓ z is empty for every z ∈ b X . Here b X is the completion of X as defined in Finkel and Goubault-Larrecq, Forward Analysis for WSTS, Part I: Completions, STACS’09, pages 433-444, 2009. This generalizes a use...
متن کاملForward Analysis for WSTS, Part II: Complete WSTS
We describe a simple, conceptual forward analysis procedure for ∞complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the cover of s0. When S is the completion of a WSTS X, the clover in S is a finite description of the cover in X. We show that this applies exactly when X is an ω-WSTS, a new robust class of WSTS. We show that our procedure termin...
متن کاملForward Analysis and Model Checking for Bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of Ginsburg and Spanier (Trans. AMS 1964)— complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and GoubaultLarrecq (ICALP 2009b). Indeed, we prove that, unlike other conditions considered previously for the termination of for...
متن کامل